Big O notation - PDFSEARCH.IO - Document Search Engine

Big O notation
Results: 335

#	Item
271	AL 1 Introductory Tools for Literary Analysis Add to Reading List Source URL: media.wiley.com Language: English - Date: 2013-08-25 10:14:00 Slavoj Žižek Hamlet Critical theory Literary theory Big O notation Leadership New Historicism Psychoanalytic literary criticism Interpretation Literary criticism Literature Philosophy
272	c 2014 Society for Industrial and Applied Mathematics SIAM J. DISCRETE MATH. Vol. 28, No. 1, pp. 342–371 Add to Reading List Source URL: 140.109.74.92 Language: English - Date: 2014-03-12 09:54:52 Computational complexity theory Asymptotic analysis Big O notation Mathematical notation Symbol Exponentiation Time complexity Analysis of algorithms Mathematics Applied mathematics
273	Manuscript Submission and Preparation Checklist o o o o o Add to Reading List Source URL: www.neurosciencesjournal.org Language: English - Date: 2013-04-12 14:38:46 Analysis of algorithms Asymptotic analysis Big O notation Mathematical notation Manuscript Abstract Citation Knowledge Library science Academic publishing Bibliography Academia
274	On Asymptotic Notation with Multiple Variables Rodney R. Howell Dept. of Computing and Information Sciences Kansas State University Manhattan, KS[removed]USA Add to Reading List Source URL: people.cis.ksu.edu Language: English - Date: 2008-01-18 11:45:18 Integer sequences Number theory Computational complexity theory Big O notation N1 Factorial Function Summation Analysis of algorithms Mathematics Mathematical notation Combinatorics
275	Order Notation in Practice Roger Orr OR/2 Limited What does complexity measurement mean? Add to Reading List Source URL: accu.org Language: English - Date: 2014-04-14 04:21:09 Analysis of algorithms Mathematical notation Asymptotic analysis Big O notation Structural complexity theory Blum axioms Logarithm HO Function Theoretical computer science Mathematics Computational complexity theory
276	From coding theory to efficient pattern matching Rapha¨el Clifford University of Bristol, Dept. of Computer Science Bristol, BS8 1UB, UK [removed] Klim Efremenko Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:17 Analysis of algorithms Probabilistic complexity theory Time complexity Matching Factorial Approximate string matching Randomized algorithm Big O notation Factorization of polynomials over a finite field and irreducibility tests Theoretical computer science Mathematics Computational complexity theory
277	West Tennessee Area Service Committee Minutes July 24, 2011 Brian O. opened the meeting at 2:05 with the Serenity Prayer. The 12 Traditions were read by Brooks S. The 12 Concepts were read by Patrick. The Purpose of the Add to Reading List Source URL: www.na-wt.org Language: English - Date: 2011-08-01 11:52:31 Asymptotic analysis Big O notation Mathematical notation Group action Mathematics Mathematical analysis Analysis of algorithms
278	Journal of Machine Learning Research v[removed]pp Submitted sub; Published pub On the Necessity of Irrelevant Variables David P. Helmbold Add to Reading List Source URL: www.phillong.info Language: English - Date: 2013-08-07 12:05:28 Bayesian statistics Analysis of algorithms Chernoff bound Naive Bayes classifier Big O notation Logistic regression Feature selection Errors-in-variables models Normal distribution Statistics Econometrics Regression analysis
279	Numerical results on the asymptotic rate of binary codes A. Barg and David B. Jaffe A BSTRACT. We compute upper bounds on the maximal size of a binary linear code of length n 1000, dimension k, and distance d For each va Add to Reading List Source URL: www.math.unl.edu Language: English - Date: 2000-03-22 13:00:52 Combinatorics Finite fields Information theory Error detection and correction Linear code Association scheme Constant-weight code Big O notation Distributed source coding Mathematics Coding theory Discrete mathematics
280	Element Distinctness, Frequency Moments, and Sliding Windows Paul Beame Rapha¨el Clifford Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:18 Analysis of algorithms Computational complexity theory Time complexity Element distinctness problem Randomized algorithm Algorithm Big O notation Computational complexity of mathematical operations Asymptotically optimal algorithm Theoretical computer science Applied mathematics Mathematics

UPDATE